Informative core identification in complex networks

نویسندگان

چکیده

Abstract In a complex network, the core component with interesting structures is usually hidden within noninformative connections. The noises and bias introduced by can obscure salient structure limit many network modeling procedures’ effectiveness. This paper introduces novel core–periphery model for periphery of networks without imposing specific form core. We propose spectral algorithms identification general downstream analysis tasks under model. enjoy strong performance guarantees are scalable large networks. evaluate methods extensive simulation studies demonstrating advantages over multiple traditional methods. also used to extract from citation which results in more interpretable hierarchical community detection.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Core percolation on complex networks

We analytically solve the core percolation problem for complex networks with arbitrary degree distributions. We find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is continuous while for directed networks it is discontinuous (and hybrid) if the in- and out-degree distributions differ. We also find t...

متن کامل

Core-biased random walks in complex networks

A simple strategy to explore a network is to use a random-walk where the walker jumps from one node to an adjacent node at random. It is known that biasing the random jump, the walker can explore every walk of the same length with equal probability, this is known as a Maximal Entropy Random Walk (MERW). To construct a MERW requires the knowledge of the largest eigenvalue Λ and corresponding eig...

متن کامل

Identification of core-periphery structure in networks

Many networks can be usefully decomposed into a dense core plus an outlying, loosely connected periphery. Here we propose an algorithm for performing such a decomposition on empirical network data using methods of statistical inference. Our method fits a generative model of core-periphery structure to observed data using a combination of an expectation-maximization algorithm for calculating the...

متن کامل

Classifying informative and imaginative prose using complex networks

Statistical methods have been widely employed in recent years to grasp many language properties. The application of such techniques have allowed an improvement of several linguistic applications, which encompasses machine translation, automatic summarization and document classification. In the latter, many approaches have emphasized the semantical content of texts, as it is the case of bag-of-w...

متن کامل

Core-periphery organization of complex networks.

Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. Among...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of The Royal Statistical Society Series B-statistical Methodology

سال: 2023

ISSN: ['1467-9868', '1369-7412']

DOI: https://doi.org/10.1093/jrsssb/qkac009